Large-Order Multiple Recursive Generators with Modulus 231 - 1
نویسندگان
چکیده
T performance of a maximum-period multiple recursive generator (MRG) depends on the choices of the recurrence order k, the prime modulus p, and the multipliers used. For a maximum-period MRG, a largeorder k not only means a large period length (i.e., p − 1) but, more importantly, also guarantees the equidistribution property in high dimensions (i.e., up to k dimensions), a desirable feature for a good random-number generator. As to generating efficiency, in addition to the multipliers, some special choices of the prime modulus p can significantly speed up the generation of pseudo-random numbers by replacing the expensive modulo operation with efficient logical operations. To construct efficient maximum-period MRGs of a large order, we consider the prime modulus p = 231 − 1 and, via extensive computer search, find two large values of k, 71499 and 201897, for which p − 1 can be completely factorized. The successful search is achieved with the help of some results in number theory as well as some modern factorization methods. A general class of MRGs is introduced, which includes several existing classes of efficient generators. With the factorization results, we are able to identify via computer search within this class many portable and efficient maximum-period MRGs of order 71499 or 201897 with prime modulus 231 − 1 and multipliers of powers-of-two decomposition. These MRGs all pass the stringent TestU01 test suite empirically.
منابع مشابه
On the Period Length of Pseudorandom Vector Sequences Generated by Matrix Generators
In Tahmi [5], Niederreiter [4], Afflerbach and Grothe [1], and Grothe [2] linear recursive congruential matrix generators for generating r-dimensional pseudorandom vectors are analyzed. In particular, conditions are established which ensure that the period length equals pr — 1 for any nonzero starting vector in case of a prime modulus p. For a modulus of the form pa, a > 2 and p prime, this pap...
متن کاملScalable parallel multiple recursive generators of large order
To speed up the process of performing a large statistical simulation study, it is natural and common to divide the large-scale simulation task into several relatively independent subtasks in a way that these sub-tasks can be handled by individual processors in parallel. To obtain a good overall simulation result by synthesizing results from these sub-tasks, it is crucial that good parallel rand...
متن کاملAn exhaustive analysis of two-term multiple recursive random number generators with efficient multipliers
This paper presents results of an exhaustive computer search for the maximum spectral value in full period two-term kth-order multiple recursive generators (MRGs) with efficient multipliers. For orders k = 2, 3, . . . , 7, we provide a table of kth-order MRGs with largest spectral values. These MRGs not only have the best spectral values found so far but also can be implemented efficiently by a...
متن کاملOrbits and lattices for linear random number generators with composite moduli
In order to analyze certain types of combinations of multiple recursive linear congruential generators (MRGs), we introduce a generalized spectral test. We show how to apply the test in large dimensions by a recursive procedure based on the fact that such combinations are subgenerators of other MRGs with composite moduli. We illustrate this with the well-known RANMAR generator. We also design a...
متن کاملFast combined multiple recursive generators with multipliers of the form a = ±2q ±2r
We study a class of combined multiple recursive random number generators constructed in a way that each component runs fast and is easy to implement, while the combination enjoys excellent structural properties as measured by the spectral test. Each component is a linear recurrence of order k > 1, modulo a large prime number, and the coefficients are either 0 or are of the form a = ±2q or a = ±...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- INFORMS Journal on Computing
دوره 24 شماره
صفحات -
تاریخ انتشار 2012